When Gossip Meets Consensus: Convergence in Correlated Random WSNs
نویسندگان
چکیده
We study the convergence of consensus algorithms in wireless sensor networks with random topologies where the instantaneous links exist with a given probability and are allowed to be spatially correlated. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive closed-form expressions. The general formulations allow the computation of the optimum parameters ensuring almost sure convergence to a consensus under these topology conditions. We show that the expressions derived for consensus algorithms can be particularized for gossip algorithms, particularly for the broadcast gossip algorithm and for the pair-wise gossip algorithm.
منابع مشابه
Delft University of Technology Greedy Gossip Algorithm with Synchronous Communication for Wireless Sensor Networks
Randomized gossip (RG) based distributed averaging has been popular for wireless sensor networks (WSNs) in multiple areas. With RG, randomly two adjacent nodes are selected to communicate and exchange information iteratively until consensus is reached. One way to improve the convergence speed of RG is to use greedy gossip with eavesdropping (GGE). Instead of randomly selecting two nodes, GGE se...
متن کاملReaching consensus about gossip: convergence times and costs
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust methods for distributed information processing over networks. However, for many topologies that are realistic for wireless adhoc and sensor networks (such as grids and random geometric graphs), the standard nearest-neighbor gossip converges however slowly. Moreover we show that conve...
متن کاملA local average broadcast gossip algorithm for fast global consensus over graphs
Motivated by applications to wireless sensor, peer-to-peer, and social networks, the canonical average consensus problem is considered in random and regular graphs in this paper. A local average information exchange (LAIE) algorithm is developed to compute the global consensus of the initial measurements of the nodes at every node in the network. In the proposed algorithm, each node interacts w...
متن کاملAverage-Consensus Algorithms in a Deterministic Framework
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve average-consensus are proposed. Necessary and sufficient communication conditions are given for each algorithm to achieve average-consensus. Resource costs for each...
متن کاملINDIGO: An In Situ Distributed Gossip Framework for Sensor Networks
With the onset of Cyber-Physical Systems (CPS), distributed algorithms on Wireless Sensor Networks(WSNs) have been receiving renewed attention. The distributed consensus problem is a well studied problem having a myriad of applications which can be accomplished using asynchronous distributed gossip algorithms on Wireless Sensor Networks(WSN). However, a practical realization of gossip algorithm...
متن کامل